75B - Facetook Priority Wall - CodeForces Solution

#include <iostream>
#include <string>
#include<iomanip>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <numeric>
#include<unordered_map>
#include <unordered_set>
#include <cmath>
#include<vector>
#include<algorithm>
#define ll long long
#define endl "\n"
#define GG  ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
using namespace std;
bool ok(ll mid, ll k) {
	return true;
}
ll bs(ll k) {
	ll l = 0, r = 1e10, sum = 0;
	while (l <= r) {
		ll mid = l + (r - l) / 2;
		if (ok(mid, k)) {
			sum = mid;
			l = mid + 1;
		}
		else {
			r = mid - 1;
		}
	}
	return sum;
}
ll gcd(ll n, ll m) {
	if (n == 0 || m == 0) {
		return max(n, m);
	}
	if (n == m) {
		return n;
	}
	return gcd(n % m, m % n);
}
ll lcm(ll n, ll m) {
	return (n / gcd(n, m)) * m;
}
ll fastpower(ll b, ll p) {
	ll halfpower = fastpower(b, p / 2);
	ll res = halfpower * halfpower;
	if (p % 2 != 0) {
		res *= b;
	}
	return res;
}
bool wp(const pair<int, string>& a, const pair<int, string>& b)
{
	if (a.first == b.first) {
		return a.second < b.second;
	}
	return (a.first > b.first);
}
int main() {
	//freopen("hobz.in", "r", stdin);
	//freopen("Round1.in", "r", stdin);
	//freopen("hanya.in", "r", stdin);
	//freopen("tabs.in", "r", stdin);
	GG;
	string s;
	cin >> s;
	ll t;
	cin >> t;
	map<string, ll>mp;
	while (t--) {
		string s1, s2, s3, s4, s5, a = "";
		cin >> s1 >> s2;
		if (s2 == "posted" || s2 == "commented") {
			cin >> s3;
		}
		cin >> s4 >> s5;
		s4.pop_back();
		s4.pop_back();
		a = s4;
		if (s1 == s || a == s) {
			if (s2 == "posted") {
				mp[s1] += 15;
				mp[a] += 15;
			}
			else if (s2 == "commented") {
				mp[s1] += 10;
				mp[a] += 10;
			}
			else if (s2 == "likes") {
				mp[s1] += 5;
				mp[a] += 5;
			}
		}
		mp[s1] += 0;
		mp[a] += 0;
	}
	vector<pair<ll, string>>v;
	for (auto i : mp) {
		if (i.first != s) {
			v.push_back({ i.second,i.first });
		}
	}
	sort(v.begin(), v.end(), wp);
	for (auto i : v) {
		cout << i.second << endl;
	}
	return 0;
}